Date: Tue, 10 Dec 1996 21:21:47 GMT
Server: NCSA/1.4.2
Content-type: text/html
Last-modified: Mon, 04 Sep 1995 17:39:55 GMT
Content-length: 2685

<!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN">
<!Converted with LaTeX2HTML 95.1 (Fri Jan 20 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds >
<HEAD>
<TITLE>Finding clusters quickly in parallel</TITLE>
</HEAD>
<BODY>
<meta name="description" value="Finding clusters quickly in parallel">
<meta name="keywords" value="final">
<meta name="resource-type" value="document">
<meta name="distribution" value="global">
<P>
 <BR> <HR><A NAME=tex2html6 HREF="node1.html"><IMG ALIGN=BOTTOM ALT="next" SRC="http://www.cs.washington.edu/homes/speed/figs/next_motif.gif"></A>   <IMG ALIGN=BOTTOM ALT="up" SRC="http://www.cs.washington.edu/homes/speed/figs/up_motif_gr.gif">   <IMG ALIGN=BOTTOM ALT="previous" SRC="http://www.cs.washington.edu/homes/speed/figs/previous_motif_gr.gif">         <BR>
<B> Next:</B> <A NAME=tex2html7 HREF="node1.html"> Introduction</A>
<BR> <HR> <P>
<P>
<H1>Finding clusters quickly in parallel</H1>
<P><STRONG> 
Brendan Mumey<BR> <BR> 
 Department of Computer Science<BR> 
 University of Washington, Seattle, WA 98195, USA<BR> 
 <tt> brendan@cs.washington.edu </tt> </STRONG><P>
<P><STRONG>January 27, 1995</STRONG><P>
<P>
<H3>Abstract:</H3>
<EM>This report describes the implementation of a new parallel algorithm
for finding clusters point sets of Euclidean space.
A new solution to a special case of the <em> bichromatic closest pairs
problem</em> is used by the algorithm.
The implementation was done in an environment
for distributed tree computations on the Kendall Square Research KSR-2
multiprocessor.
<P>
</EM><P>
<BR> <HR>
<UL> 
<LI> <A NAME=tex2html8 HREF="node1.html#SECTION00010000000000000000"> Introduction</A>
<LI> <A NAME=tex2html9 HREF="node2.html#SECTION00020000000000000000"> The Algorithm</A>
<UL> 
<LI> <A NAME=tex2html10 HREF="node3.html#SECTION00021000000000000000"> The Comparison-Pair Subroutine</A>
<LI> <A NAME=tex2html11 HREF="node4.html#SECTION00022000000000000000"> Parallelization Issues</A>
</UL> 
<LI> <A NAME=tex2html12 HREF="node5.html#SECTION00030000000000000000"> Implementation and Performance</A>
<LI> <A NAME=tex2html13 HREF="node6.html#SECTION00040000000000000000"> Conclusions</A>
<LI> <A NAME=tex2html14 HREF="node7.html#SECTION00050000000000000000">References</A>
<LI> <A NAME=tex2html15 HREF="node8.html#SECTION00060000000000000000"> Analysis of the comparison-pair subroutine</A>
<UL> 
<LI> <A NAME=tex2html16 HREF="node9.html#SECTION00061000000000000000"> Three dimensions</A>
</UL> 
<LI> <A NAME=tex2html17 HREF="node10.html#SECTION00070000000000000000">   About this document ... </A>
</UL>
<BR> <HR>
<P><ADDRESS>
<I>Brendan Mumey <BR>
Mon Sep  4 09:59:57 PDT 1995</I>
</ADDRESS>
</BODY>
